branch-bound algorithm meaning in English

分支界限算法

So a lot of researchers have attached importance to optimization computing , and put forward all kinds of algotithms for optimization problems , for instance : simplex algorithm , dynamic programming algorithm , branch - bound algorithm , etc . but these algorithms are all disadvantage and can not be applied to complex nonlinear optimization problems
为了解决各种优化计算问题，人们提出了各种各样的优化计算方法，如单纯形法、梯度法、动态规划法、分枝剪界法。这些优化算法各有各的长处，各有各的适用范围，也有各自的限制。